An improved fast Fourier transform algorithm using mixed frequency and time decimations
نویسندگان
چکیده
منابع مشابه
Using a Fast Fourier Transform Algorithm
The symmetry and periodicity properties of the discrete Fourier transform (DFT) allow a variety of useful and interesting decompositions. In particular, by clever grouping and reordering of the complex exponential multiplications it is possible to achieve substantial computational savings while still obtaining the exact DFT solution (no approximation required). Many “fast” algorithms have been ...
متن کاملAn Equivariant Fast Fourier Transform Algorithm
This paper presents a generalization of the Cooley-Tukey fast Fourier transform algorithm that respects group symmetries. The algorithm, when applied to a function invariant under a group of symmetries, fully exploits these symmetries to reduce both the number of arithmetic operations and the amount of memory used. The symmetries accommodated by the algorithm include all of the crystallographic...
متن کاملFractional-Fourier-transform calculation through the fast-Fourier-transform algorithm.
A method for the calculation of the fractional Fourier transform (FRT) by means of the fast Fourier transform (FFT) algorithm is presented. The process involves mainly two FFT's in cascade; thus the process has the same complexity as this algorithm. The method is valid for fractional orders varying from -1 to 1. Scaling factors for the FRT and Fresnel diffraction when calculated through the FFT...
متن کاملAn Improved Quantum Fourier Transform Algorithm and Applications
We give an algorithm for approximating the quantum Fourier transform over an arbitrary Zp which requires only O(n logn) steps where n = log p to achieve an approximation to within an arbitrary inverse polynomial in n. This improves the method of Kitaev [11] which requires time quadratic in n. This algorithm also leads to a general and efficient Fourier sampling technique which improves upon the...
متن کاملTime-Frequency Analysis Using Short Time Fourier Transform
A time-frequency analysis, which represents the time change of a signal, is significant in all fields. Wigner distribution, a short time Fourier transform (STFT), a kernel method, and a characteristic function method etc. are known as a time-frequency analyzing method, and those methods have merits and demerits. STFT method has been used as ultrasound blood-flow imaging for a long time, because...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Acoustics, Speech, and Signal Processing
سال: 1988
ISSN: 0096-3518
DOI: 10.1109/29.1522